Constraint Logic
نویسندگان
چکیده
This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to deene a trace semantics T. Next, an equivalent xpoint semantics F is deened: a dataaow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least xpoint determines one set of constraints for each node of the dataaow graph. To prove that F and T are equivalent, an intermediate semantics O is used, which propagates a given set of constraints through the paths of the dataaow graph. Possible applications of F (and O) are discussed: in particular, its incrementality is used to deene a parallel execution model for clp's based on asynchronous processors assigned to the nodes of the program graph. Moreover, O is used to formalize the Intermittent Assertion Method of Burstall Bur74] for constraint logic programs.
منابع مشابه
Optimized Fuzzy Logic for Nonlinear Vibration Control of Aircraft Semi-active Shock Absorber with Input Constraint (TECHNICAL NOTE)
Landing impact and runway unevenness have proximate consequence on performance of landing gear system and conduce to discomfort of passengers and reduction of the pilot’s capability to control aircraft. Finally, vibrations caused by them result in structure fatigue. Fuzzy logic controller is used frequently in different applications because of simplicity in design and implementation. In the pre...
متن کاملCategory-based constraint logic
This research exploits the view of constraint programming as computation in a logical system, namely constraint logic. The basic ingredients of constraint logic are: constraint models for the semantics (they form a comma-category over a fixed model of “built-ins”), generalized polynomials in the rôle of basic syntactic ingredient, and a constraint satisfaction relation between semantics and syn...
متن کاملA Category-Based Equational Logic Semantics to Constraint Programming
This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. We dene the basic ingredients of constraint logic, such as constraint models and generalised polynomials. We show that constraint logic is an institution , and we internalise the study of constraint logic to the framework of category-based equational logic. By showing tha...
متن کاملLearning Constraint Satisfaction Problems: An ILP Perspective
We investigate the problem of learning constraint satisfaction problems from an inductive logic programming perspective. Constraint satisfaction problems are the underlying basis for constraint programming and there is a long standing interest in techniques for learning these. Constraint satisfaction problems are often described using a relational logic, so inductive logic programming is a natu...
متن کاملToward Observational Equivalences for Linear Logic Concurrent Constraint Languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کاملObservational equivalences for linear logic concurrent constraint languages
Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition ...
متن کامل